Informatics Publishing Limited

Akhil Khare ¹, Meenu Kumari ¹, Pallavi Khare ²

Affiliations
1 Department of IT, Bharati Vidyapeeth, University & College of Engineering, Pune - 411 043, IN
2 Department of E & TC, SSSIST, Bhopal - 462 039, IN

Abstract

In any communication, security is the most important issue in today’s world. Lots of data security and data hiding algorithms have been developed in the last decade, which worked as motivation for our research. In this project, named “JPEG Compression Steganography”, we have designed a system that will allow an average user to securely transfer text messages by hiding them in a digital image file using the local characteristics within an image. This project is a combination of steganography and encryption algorithms, which provides a strong backbone for its security. The proposed system not only hides large volume of data within an image, but also limits the perceivable distortion that might occur in an image while processing it. This software has an advantage over other information security software because the hidden text is in the form of images, which are not obvious text information carriers. The project contains several challenges that make it interesting to develop. The central task is to research available steganography and encryption algorithms to pick the one the offer the best combination of strong encryption, usability and performance. The main advantage of this project is a simple, powerful and user-friendly GUI that plays a very large role in the success of the application.

Keywords

JPEG Compression Steganography.

Full Text

   

Akhil Khare ¹, Harsh Lohani ², Pallavi Khare ³

Affiliations
1 Department of Information Technology, Bharati Vidyapeeth College of Engineering, Pune, IN
2 Department of IT, BVUCOE, Pune, IN
3 Department of E&TC, SSSIST, Bhopal, IN

Abstract

The first step taken while developing software, by an analyst is to construct a sequence diagram which describes the interaction that must occur between classes. The sequence diagram does not show the interaction of classes at run time. It shows static coupling, i.e. it only acknowledges the number of interactions between the classes. There have been many studies done regarding the relationship between coupling and external quality factors of object-oriented software. A common way to define and measure coupling is through structural properties and static code analysis. However, because of polymorphism, dynamic binding, and the common presence of unused or dead code in commercial software, the resulting coupling measures are not precise as they do not perfectly reflect the actual coupling taking place among classes dynamically. This paper proposes the use of the estimated frequency of the use cases and propagates these frequencies through the sequence diagram to estimate dynamic coupling. This can be done by using Dynamic Clustering Mechanism (DCM) in which classes which interact with high frequency are clustered or grouped together (called as hot spots), which are highly dynamically coupled. With this evaluation we will be able to determine which hot spot are indeed relevant and actually deserves close attention from the designer w.r.t design of each class.

Keywords

Dynamic Coupling Measurement, DCM, Class Interaction at Run Time, Re-Engineering, Dynamic Clustering Mechanism.

Full Text